FTRLIM: Distributed Instance Matching Framework for Large-Scale Knowledge Graph Fusion
نویسندگان
چکیده
منابع مشابه
A Distributed Framework for Large-Scale Time-Dependent Graph Analysis
In the last few years, we have seen that many applications or computer problems are mobilized as a graph since this data structure gives a particular handling for some use cases such as social networks, bioinformatics, road networks and communication networks. Despite its importance, the graph processing remains a challenge when dealing with large graphs. In this context, several solutions and ...
متن کاملLarge scale instance matching via multiple indexes and candidate selection
Instance Matching aims to discover the linkage between different descriptions of real objects across heterogeneous data sources. With the rapid development of Semantic Web, especially of the linked data, automatically instance matching has been become the fundamental issue for ontological data sharing and integration. Instances in the ontologies are often in large scale, which contains millions...
متن کاملScalability in Ontology Instance Matching of Large Semantic Knowledge base
The rapid growth of heterogeneous sources of massive ontology instances raises a scalability issue in ontology instance matching of semantic knowledge bases. In this paper, we propose an efficient method of instance matching by considering secondary classification of monotonic large instances to achieve scalability. We use a taxonomy of the ACM’s Computing Classification System (CCS) for second...
متن کاملDistributed Computation of Large-scale Graph Problems
Motivated by the increasing need for fast distributed processing of large-scale graphs such as the Web graph and various social networks, we study a number of fundamental graph problems in the message-passing model, where we have k machines that jointly perform a computation on an arbitrary n-node (typically, n ≫ k) input graph. The graph is assumed to be randomly partitioned among the k ≥ 2 ma...
متن کاملLarge Scale Skill Matching through Knowledge Compilation
We present a logic-based framework for automated skill matching, able to return a ranked referral list and the related ranking explanation. Thanks to a Knowledge Compilation approach, a knowledge base in Description Logics is translated into a relational database, without loss of information. Skill matching inference services are then efficiently executed via SQL queries. Experimental results f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2021
ISSN: 1099-4300
DOI: 10.3390/e23050602